package leetcode.search;


import leetcode.search.comon.SearchUtils;

/**
 * AC
 */
class Solution33 {
    public int search(int[] nums, int target) {

        return SearchUtils.findTheKey(nums, target);

    }
}
/**
 * 33. 搜索旋转排序数组
 */
public class leetcode33 {

    public static void main(String[] args) {

//        int[] nums = {4,5,6,7,0,1,2};
//        int target = 0;
//        int target = 3;

        int[] nums = {1};
        int target = 0;


        Solution33 solution33 = new Solution33();
        int result = solution33.search(nums, target);
        System.out.println(result);
    }

}
